Improved lower bound for deterministic broadcasting in radio networks
نویسندگان
چکیده
منابع مشابه
Improved lower bound for deterministic broadcasting in radio networks
We consider the problem of deterministic broadcasting in radio networks when the nodes have limited knowledge about the topology of the network. We show that for every deterministic broadcasting protocol there exists a network, of radius 2, for which the protocol takes
متن کاملDeterministic Radio Broadcasting
We consider broadcasting in radio networks: one node of the network knows a message that needs to be learned by all the remaining nodes. We seek distributed deterministic algorithms to perform this task. Radio networks are modeled as directed graphs. They are unknown, in the sense that nodes are not assumed to know their neighbors, nor the size of the network, they are aware only of their indiv...
متن کاملA Lower Bound for Broadcasting in Mobile Ad Hoc Networks
We give a lower bound of Ω(n) rounds for broadcasting in mobile ad hoc networks, where n is the number of nodes in the network. A round is the time taken by a node to successfully transmit a message to all its neighbors. It has been shown by Bruschi et al. and Chlebus et al. that a minimum of Ω(log n) time-slots are required in a round to propagate the broadcast message by one hop. In static ne...
متن کاملFaster Deterministic Broadcasting in Ad Hoc Radio Networks
We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic broadcasting algorithm working for arbitrary n-node ad hoc radio networks, has running time O(n log n). Our main...
متن کاملTime of Deterministic Broadcasting in Radio Networks with Local Knowledge
We consider broadcasting in radio networks, modeled as undirected graphs, whose nodes know only their own label and labels of their neighbors. In every step every node acts either as a transmitter or as a receiver. A node acting as a transmitter sends a message which can potentially reach all of its neighbors. A node acting as a receiver in a given step gets a message if and only if exactly one...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.03.003